Equidistribution and Sign-Balance on 321-Avoiding Permutations
نویسندگان
چکیده
Let Tn be the set of 321-avoiding permutations of order n. Two properties of Tn are proved: (1) The last descent and last index minus one statistics are equidistributed over Tn, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2n and T2n+1 are essentially equal to the last-descent enumerator for Tn. The proofs use a recursion formula for an appropriate multivariate generating function.
منابع مشابه
Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations
Adin and Roichman proved a set of refined sign-balance identities on 321-avoiding permutations respecting the last descent of the permutations, which we call the identities of Adin–Roichman type. In thiswork,we construct a new involution onplane trees that proves refined sign-balance properties on 321-avoiding alternating permutations respecting the first and last entries of the permutations re...
متن کاملRefined sign-balance on 321-avoiding permutations
The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the n−1 2 th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance property respecting the length of the longest increasing subsequence of the permutation. In addition, this yields a combinatorial proof of a recent analogous resul...
متن کاملEquidistribution and Sign-balance on 132-avoiding Permutations
Let Rn be the set of all permutations of length n which avoid 132. In this paper we study the statistics last descent (“ldes”), first descent (“fdes”), last rise (“lris”), and first rise (“fris”) on the set Rn. In particular, we prove that the bistatistic (“fris”,“lris”) on the set of all permutations Rn\{n . . . 21} and the bistatistic (“n− ldes”,“n− fdes”) on the set of all permutations of Rn...
متن کاملBaxter Permutations, Maj-balances, and Positive Braids
In this paper we present two interesting properties of 321-avoiding Baxter permutations. The first one is a variant of refined major-balance identity for the 321avoiding Baxter permutations, respecting the number of fixed points and descents. The second one is a bijection between the 321-avoiding Baxter permutations with the entry 1 preceding the entry 2 and the positive braid words on four str...
متن کاملOn 1212-Avoiding Restricted Growth Functions
Restricted growth functions (RGFs) avoiding the pattern 1212 are in natural bijection with noncrossing partitions. Motivated by recent work of Campbell et al., we study five classical statistics bk, ls, lb, rs and rb on 1212-avoiding RGFs. We show the equidistribution of (ls, rb, lb, bk) and (rb, ls, lb,bk) on 1212-avoiding RGFs by constructing a simple involution. To our surprise, this result ...
متن کامل